On combined phase 1-phase 2 projective methods for linear programming
نویسندگان
چکیده
منابع مشابه
An O( P Nl)-iteration Combined Phase I-phase Ii Potential Reduction Algorithm for Linear Programming
We show that a modiication of the combined Phase I-Phase II interior-point algorithm for linear programming, due to Anstreicher, de Ghellinck and Vial, Fra-ley, and Todd, terminates in O(p nL) iterations from a suitable initial (interior but infeasible) solution. The algorithm either detects infeasibility, or approaches feasibility and optimality simultaneously, or generates a feasible primal-d...
متن کاملA Parametric Approach for Solving Multi-Objective Linear Fractional Programming Phase
In this paper a multi - objective linear fractional programming problem with the fuzzy variables and vector of fuzzy resources is studied and an algorithm based on a parametric approach is proposed. The proposed solving procedure is based on the parametric approach to find the solution, which provides the decision maker with more complete information in line with reality. The simplicity of the ...
متن کاملDeveloping new methods to monitor phase II fuzzy linear profiles
In some quality control applications, the quality of a process or a product is described by the relationship between a response variable and one or more explanatory variables, called a profile. Moreover, in most practical applications, the qualitative characteristic of a product/service is vague, uncertain and linguistic and cannot be precisely stated. The purpose of this paper is to propose a ...
متن کاملCorruption Robust Phase Retrieval via Linear Programming
We consider the problem of phase retrieval from corrupted magnitude observations. In particular we show that a fixed x0 ∈ Rn can be recovered exactly from corrupted magnitude measurements |〈ai, x0〉|+ ηi, i = 1, 2 . . . m with high probability for m = O(n), where ai ∈ Rn are i.i.d standard Gaussian and η ∈ Rm has fixed sparse support and is otherwise arbitrary, by using a version of the PhaseMax...
متن کاملLinear concurrent constraint programming : operational and phase
In this paper we settle a logical semantics for the class CC of concurrent constraint programming languages and for its extension LCC based on linear constraint systems. Besides the characterization in intuitionistic logic of the stores of CC computations, we show that both the stores and the successes of LCC computations can be characterized in intuitionistic linear logic. We illustrate the us...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 1993
ISSN: 0178-4617,1432-0541
DOI: 10.1007/bf01185339